import java.util.ArrayList;
import java.util.Scanner;

public class MergeSort {

    public static void main(String[] args) {
        ArrayList<Integer> array = new ArrayList<Integer>();
        Scanner in = new Scanner(System.in);
        String l = in.nextLine();
        Scanner sc = new Scanner(l);
        while(sc.hasNext()) {
            array.add(sc.nextInt());
        }
        Integer[] arr = new Integer[array.size()];
        arr = array.toArray(arr);
        sort(arr);
        for (Integer integer : arr) {
            System.out.print(integer + " ");
        }
    }

    public static void sort(Integer[] array) {
        Integer[] temp = new Integer[array.length];
        mergeSort(array, 0, array.length-1, temp);
    }

    public static void mergeSort(Integer[] array, int left, int right, Integer[] temp) {
        System.out.print("array=");
        for (Integer a : array) {
            System.out.print(a + " ");
        }
        System.out.println();

        System.out.println("left= "+left+" , right= "+right);

        System.out.print("temp=");
        for (Integer a : temp) {
            System.out.print(a + " ");
        }
        System.out.println();
        System.out.println("------------------");

        if (left < right) {
            int mid = (left + right) / 2;
            mergeSort(array, left, mid, temp);
            mergeSort(array, mid+1, right, temp);
            merge(array, left, mid, right, temp);
        }
    }

    public static void merge(Integer[] array, int left, int mid, int right, Integer[] temp) {

        System.out.println("left= "+left+" , mid= "+mid+" , right= "+right);

        int i = left;
        int j = mid + 1;
        int t = 0;

        while (i <= mid && j <= right) {
            if (array[i] < array[j]) {
                temp[t++] = array[i++];
            } else {
                temp[t++] = array[j++];
            }
        }

        while (i<=mid) {
            temp[t++] = array[i++];
        }

        while (j<=right) {
            temp[t++] = array[j++];
        }

        for (int k = 0; k < t; k++) {
            array[left++] = temp[k];
        }
    }

}
